Quesnay's Tableau Economique

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tableau Recycling

In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walker. The algorithm proves whether a property expressed in the modal mu-calculus holds for a state in a finite transition system. It makes subsequent use of subtableaux which were calculated earlier in the proof run. These aubtab|eaux are reduced to expressions. Examples show that both size of tabl...

متن کامل

Tableau Complexes

Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such tableau complexes have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions [BP79]. In our motivating example, the facets are labeled by semistan...

متن کامل

One Tableau Suffices

The grammars of any OT typology can be derived from a single tableau in which each row, when asserted as optimal, delivers the grammar of a language in the typology. In the single-tableau representation, each candidate represents an entire language. When, as is typically the case, a typology is constructed from more than one candidate set, a single tableau representation may be built from the M...

متن کامل

Proof Confluent Tableau Calculi

A tableau calculus is proof confluent if every partial tableau proof for an unsatisfiable formula can be extended to a closed tableau. A rule application may be redundant but it can never prevent the construction of a proof; there are no “dead ends” in the proof search. Proof confluence is a prerequisite of (a) backtrackingfree proof search and (b) the generation of counter examples to non-theo...

متن کامل

A Tableau for CTL

We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of computation tree logic CTL*. This is the first such tableau. CTL* is an exceptionally important temporal logic with applications from hardware design to agent reasoning but there is no easy automated reasoning approach to CTL*. The tableau here is a traditional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Economic Journal

سال: 1895

ISSN: 0013-0133

DOI: 10.2307/2956222